Orbit-Stabilizer Theorem
Orbit-Stabilizer Theorem
Introduction
The Orbit-Stabilizer Theorem is one of the most useful theorems in group theory. It provides a fundamental relationship between the size of orbits and the index of stabilizers, offering a powerful tool for counting and understanding group actions.
Statement
Theorem 6.2 (Orbit-Stabilizer Theorem): Let a finite group
This theorem provides a powerful formula:
Proof Sketch
The proof uses the fact that there is a bijection between the orbit of
Key Steps in the Proof
-
Define the map:
by -
Show it's well-defined: If
, then , so -
Show it's injective: If
, then -
Show it's surjective: Every coset
is the image of -
Conclude: Since there's a bijection,
Examples
Example 1: Action of on
Consider the natural action of
- The orbit of any element is the entire set
(the action is transitive) - The stabilizer of 1 is
- By the orbit-stabilizer theorem:
Example 2: Action of on Vertices
Consider the action of
- The orbit of any vertex is the entire set of vertices (transitive action)
- The stabilizer of a vertex consists of the identity and the reflection across the diagonal through that vertex
- By the orbit-stabilizer theorem:
Example 3: Conjugation Action
When a group
- The orbit of an element
is its conjugacy class: - The stabilizer of
is its centralizer: - The orbit-stabilizer theorem gives:
Applications
Application 1: Counting Orbits
The orbit-stabilizer theorem is often used to count the number of elements in orbits, which is useful in combinatorics and group theory.
Application 2: Understanding Group Structure
The theorem helps us understand the structure of groups by relating orbit sizes to subgroup indices.
Application 3: Class Equation
When a group acts on itself by conjugation, the orbit-stabilizer theorem leads to the class equation, which is fundamental for understanding the structure of finite groups.
Application 4: Burnside's Lemma
The orbit-stabilizer theorem is used in the proof of Burnside's Lemma, which counts the number of orbits.
Special Cases
Transitive Actions
If the action is transitive, then
Free Actions
If the action is free, then
Regular Actions
If the action is regular (transitive and free), then